Parity Games and Propositional Proofs
نویسندگان
چکیده
منابع مشابه
A Parity Games and Propositional Proofs
A propositional proof system is weakly automatizable if there is a polynomial time algorithm which separates satisfiable formulas from formulas which have a short refutation in the system, with respect to a given length bound. We show that if the resolution proof system is weakly automatizable, then parity games can be decided in polynomial time. We give simple proofs that the same holds for de...
متن کاملMean-Payoff Games and Propositional Proofs
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the value of the game is negative the formula has a polynomial-size refutation in Σ2-Frege (i.e. DNF-resolution). This reduces mean-payoff games to the weak automatizability of Σ2-Frege, and to the interpolation problem for Σ...
متن کاملFrom Parity Games to Circular Proofs
We survey on the ongoing research that relates the combinatorics of parity games to the algebra of categories with finite products, finite coproducts, initial algebras and final coalgebras of definable functors, i.e. μ-bicomplete categories. We argue that parity games with a given starting position play the role of terms for the theory of μ-bicomplete categories. We show that the interpretation...
متن کاملPropositional Consistency Proofs
Partial consistency statements can be expressed as polynomial-size propositional formulas. Frege proof systems have polynomial-size partial self-consistency proofs. Frege proof systems have polynomialsize proofs of partial consistency of extended Frege proof systems if and only if Frege proof systems polynomially simulate extended Frege proof systems. We give a new proof of Reckhow’s theorem th...
متن کاملCompositional Propositional Proofs
Many hard-combinatorial problems have only be solved by SAT solvers in a massively parallel setting. This reduces the trust one has in the final result as errors might occur during parallel SAT solving or during partitioning of the original problem. We present a new framework to produce clausal proofs for cube-and-conquer, arguably the most effective parallel SAT solving paradigm for hard-combi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2014
ISSN: 1529-3785,1557-945X
DOI: 10.1145/2579822